Dynamic stack allocating method in multi-threaded operating systems

ABSTRACT

Provided is a method of dynamically reallocating a thread stack in a multi-threaded operating system, and more particularly, a method of dynamically allocating a thread stack of a multi-threaded operating system in an embedded system for wireless sensor nodes. The method includes the steps of: measuring sizes of data and non-data sections of a stack with respect to each thread; determining a new size of the non-data section of each stack based on the size of the data section of the stack measured with respect to each thread; and adjusting the size of the non-data section of each stack to the determined new size. According to the method, even without the source code analysis, an amount of memory spaces to be used can be reduced compared to that of a conventional static stack allocation method.

CROSS-REFERENCE TO RELATED APPLICATION

This application claims priority to and the benefit of Korean Patent Application No. 2007-42626, filed May 2, 2007, the disclosure of which is incorporated herein by reference in its entirety.

BACKGROUND

1. Field of the Invention

The present invention relates to a method of dynamically allocating a thread stack in a multi-threaded operating system, and more particularly, to a method of dynamically allocating a thread stack in a multi-threaded operating system of an embedded system for wireless sensor nodes.

The present invention has been produced from the work supported by the IT R&D program of MIC (Ministry of Information and Communication)/IITA (Institute for Information Technology Advancement) [2006-S-085-01, Nano OS for Automobile Sensor Nodes]

2. Discussion of Related Art

A wireless sensor networks include hundreds or thousands of wireless sensor nodes. These wireless sensor nodes collect information and process the information to communicate with neighboring nodes. Generally, a wireless sensor node includes with a small amount of memory (such as 2 KB to 10 KB), without a memory hardware protection device, i.e., a Memory Management Unit (MMU), because of low power and low cost. However, to perform multiple tasks in parallel in the memory-restricted embedded system, a multi-threaded operating system is needed.

In general, in the multi-threaded operating system, thread stacks are statically allocated in a memory space. In a static allocating method, a stack space to be used by the corresponding thread when a thread is generated is statically allocated and is not changed when a program is executed. Therefore, when the stack space allocated to the thread is partially used, this causes waste of memory in the remaining space. Also, in this method, a thread that requires more stack memory cannot use the memory, and thus a problem such as a stack overflow frequently occurs.

In view of this drawback, while a method of allocating a thread stack based on source code analysis has been suggested, the source code analysis is very complicated and takes too much time.

SUMMARY OF THE INVENTION

The present invention is directed to a method of dynamically allocating a thread stack, which enables efficient use of a memory space in a multi-threaded operating system of a sensor node having a restricted memory space.

The present invention is also directed to a method of dynamically allocating a thread stack based on stack usage information, which is measured during the execution of a program in a multi-thread operating system of a sensor node.

One aspect of the present invention provides a method of dynamically allocating a thread stack in a multi-threaded operating system comprising the steps of: measuring sizes of data and non-data sections of a stack with respect to each thread; determining a new size of the non-data section of each stack based on the size of the data section of the stack measured with respect to each thread; and adjusting the size of the non-data section of each stack to the determined new size.

When there is a difference between the current size of a non-data section and the new size of the non-data section of a lower stack, the step of adjusting the size of the non-data section of each stack may comprise the step of transferring a data section of a higher stack adjacent to the lower stack to a higher memory region or a lower memory region by the difference.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other features and advantages of the present invention will become more apparent to those of ordinary skill in the art by describing in detail exemplary embodiments thereof with reference to the attached drawings in which:

FIG. 1 illustrates the configuration of a general memory map in a multi-threaded operating system;

FIG. 2 illustrates a process of performing a method of dynamically allocating a thread stack according to an exemplary embodiment of the present invention;

FIG. 3 illustrates an example of a process of stack allocation according to an exemplary embodiment of the present invention;

FIG. 4 illustrates another example of a process of stack allocation according to an exemplary embodiment of the present invention; and

FIG. 5 illustrates a stack allocation algorithm according to an exemplary embodiment of the present invention.

DETAILED DESCRIPTION OF EMBODIMENTS

The present invention will now be described more fully hereinafter with reference to the accompanying drawings, in which exemplary embodiments of the invention are shown.

FIG. 1 illustrates a general memory map of a multi-threaded operating system. As illustrated, a heap section 110 and stack sections 120 and 130 may share a memory space, so that the larger the heap section 110 becomes, the smaller the stack sections 120 and 130 become, and vice versa. The stack section is largely divided into a system stack section 130 and a user stack section 120, and the user stack section 120 is divided to be allocated to each of multi-threads. Each of the multi-threads S₁, S₂, S₃ and S₄ is divided into a data section and a non-data section. Data sections x₁, x₂, x₃, and x₄ are memory regions where stack data has ever been contained in the entire stack space, and non-data sections y₁, y₂, y₃, and y₄ are sections that do not include the stack data yet.

The non-data section may be an section excluding the data section from the entire stack section. The size of the non-data section should be determined by taking into account the size of the data section. When the size of the non-data section is extremely large, considerable waste of a stack memory occurs, and when it is extremely small, a stack overflow may occur. Generally, the appropriate size of the non-data section may be about 10% to 20% of the size of the data section.

FIG. 2 illustrates a process of performing a method of dynamically reallocating a thread stack according to an exemplary embodiment of the present invention. As illustrated in FIG. 2, during execution of a program, a tick interrupt occurs periodically. The tick interrupt is a timer interrupt that occurs at periodic intervals. Whenever the tick interrupt occurs periodically, an interrupt service routine performs reallocation of a thread stack.

To be specific, in step 210, the sizes of the data and non-data sections of each thread stack are calculated. After the size of the data section is measured, the size of the data section may be deducted from the entire stack size to calculate the size of the non-data section.

In the next step 220, the size of the data section of each thread stack is taken into account to determine the new size of the non-data section. Since the data section is an section in which data is actually stored, the data section cannot be adjusted. Therefore, the size of the entire stack may be controlled by adjusting the size of the non-data section only.

When the size of the non-data section is extremely small, it should be larger, and when it is extremely large, it should be smaller. The optimal size of the non-data section varies depending on an application, and thus it is not easily determined. According to an exemplary embodiment of the present invention, the optimal size of the non-data section may be determined by taking into account the following:

(1) A new size of a non-data section should be determined with reference to the current size of a data section. When the current size of the data section is large, it is necessary to enlarge the non-data section. (For example, in the exemplary embodiment, the size of the non-data section may be determined to be about 10% to 20% of the size of the data section);

(2) The new size of the non-data section should be equal to or greater than a predetermined threshold value. Generally, when a certain function is called, data corresponding to the number of specific bytes is stored in a stack, for example, current register values should be stored in the stack; and

(3) When the current size of the non-data section is extremely small, it is necessary to enlarge it, and when it is extremely large, it is necessary to reduce it. However, the occurrence of stack overflow should be considered while the size is reduced.

Finally, in step 230, the size of the non-data section of each thread stack should be re-adjusted as determined in step 220. The adjustment of the size of the non-data section is sequentially performed from a lower stack to a higher stack, and is performed by transferring a data section of a stack to a higher memory region or to a lower memory region. At this time, the stack data should not be damaged, and the occurrence of overhead should be minimized.

FIG. 3 illustrates an example of a process of reallocating a stack according to an exemplary embodiment of the present invention. In this example, it is assumed that there are four threads, each of which has a thread stack having a size of 100 bytes. When the sizes of the data section and non-data section of each thread stack are represented by (x_(i), y_(i))(1<=i<=the number of threads), the sizes of the data section and non-data section of the four thread stacks may be represented as (50, 50), (80, 20), (60, 40), and (60, 40) as illustrated in (a) of FIG. 3. Also, it is assumed that the new size ( y ₁, y ₂, y ₃ and y ₄) of non-data sections of each thread stack is determined as (30, 60, 30 and 20) in the process of determining the new stack size. A process of changing to the non-data section having the new size of the thread stack will be described as follows:

(1) The stack is extended toward lower addresses. Therefore, size x₁ of a data section of Stack 1 is not affected by the control of size y₁ of a non-data section of Stack 1, and thus does not need to be changed;

(2) As illustrated in (b) of FIG. 3, to make size y₁ of the non-data section of Stack 1 to 30 bytes, size x₂ of the data section of Stack 2 is decreased by 20 bytes (during this process, size y₂ of the non-data section of Stack 2 becomes 40 bytes);

(3) As illustrated in (c) of FIG. 3, to make size y₂ of the non-data section of Stack 2 to 60 bytes, size x₃ of the data section of Stack 3 is increased by 20 bytes (during this process, size y₃ of the non-data section of Stack 3 becomes 20 bytes);

(4) As illustrated in (d) of FIG. 3, to make size y₃ of the non-data section of stack 3 to 30 bytes, size x₄ of the data section of Stack 4 is increased by 10 bytes (during this process, size y₄ of the non-data section of Stack 4 becomes 30 bytes); and

(5) As illustrated in (e) of FIG. 3, size y₄ of the non-data section of Stack 4 is adjusted to 20 bytes.

When transferring size x₂ of the data section of Stack 2 to a lower section in the above-mentioned process (2), it may be shown that the data section of Stack 1 having size x₁ pulls the data section of Stack 2 having size x₂. Similarly, in the processes (3) and (4), it may be shown that the data section having size x₁ pushes the data section having size x_(i+1).

In conclusion, defining Δy_(i)= y _(i)−y_(i), when Δy_(i)=0, it is unnecessary to transfer size x₊₁. When Δy_(i)>0, the data section having size x_(i) pushes the data section having size x_(i+1) by Δy_(i) (represented by Push(x_(i+1), Δy_(i))). Similarly, when Δy_(i)<0, it is shown that the data section having size x_(i) pulls the data section having size x_(i+1) by Δy_(i) (represented by Pull(x_(i+1),−Δy_(i))).

While overlap with a neighboring data section does not occur in the process of transferring the data section in FIG. 3, it may occur in some cases.

FIG. 4 illustrates a case when overlap with a data section occurs in the process of reallocating a stack. As illustrated in (a) of FIG. 4, it is assumed that (x₁,y₁)=(60,20), (x₂,y₂)=(80,20), (x₃,y₃)=(50,60) and (x₄,y₄)=(50,60) and the sizes ( y ₁, y 2, y ₃ and y ₄) of non-data sections of stacks are determined as (50, 40, 30 and 50) in the process of determining the new size of a stack. Here, since Δy₁ is 30 bytes, Push(x₂, 30) is needed for y₁ to be 50 bytes. However, when the data section having size x₂ is transferred to a higher memory region by 30 bytes, a data section having size x₃ is damaged by 10 bytes so that an overlap problem occurs. Therefore, to prevent the overlap problem, the data section having size s₃ should be transferred to a higher region first, and then the data section having size x₂ should be transferred upward. When the same is applied to x₃ and x₄, the push operation should be recursively performed.

A process of allocating a stack in consideration of the overlap problem will be described below with reference to FIG. 4.

(1) Before performing Push(x₂, 30), to make size y₁ of a non-data section of a lower stack to 50 bytes, the data section having size x₂ pushes the data section having size x₃ by 50(Δy₁+Δy₂) bytes. When the push operation is performed, y₂ becomes 70 bytes as illustrated in (b) of FIG. 4.

(2) Now, Push(x₃, 30) is performed. Even if the data section having size x₁ pushes the data section having size x₂ by 30 bytes, the overlap problem does not occur between x₂ and x₃. After Push(x₃, 30) is performed, y₁ becomes 50 bytes, and y₂ becomes 40 bytes, as illustrated in (c) of FIG. 4.

(3) Although Push(x₄, 20) is performed to make y₃ to 30 bytes, the overlap problem does not occur (refer to (d) of FIG. 4).

(4) y₄ is adjusted to 50 bytes (refer to (e) of FIG. 4).

As described above, when the allocation of a stack is performed, whether or not the overlap problem occurs should be taken into account before performing the push operation on a data section. The stack allocation, in which the overlap problem is taken into account, will be described below in more detail with reference to FIG. 5.

FIG. 5 illustrates a stack allocation algorithm according to an exemplary embodiment of the present invention. As illustrated, it is observed that when the overlap problem occurs, a function PushPull(x_(i+1),Δy_(i)) is repeatedly performed. A function PushPull(x_(i+1),Δy_(i)) serves to perform the combination of pull and push operations with respect to x_(i) in consideration of the overlap problem. To be specific, PushPull(x_(i+1),Δy_(i)) may be represented as follows.

${{PushPull}\left( {X_{i + 1},{\Delta \; y_{i}}} \right)} = \left\{ \begin{matrix} {{{Pull}\left( {X_{i + 1},{{- \Delta}\; y_{i}}} \right)},} & {{{if}\mspace{14mu} \Delta \; y_{i}} < 0} \\ {{{Push}\left( {X_{i + 1},{\Delta \; y_{i}}} \right)},} & {{{{if}\mspace{14mu} \Delta \; y_{i}} > 0},{{\Delta \; y_{i}} \leq {y_{i} + 1}}} \\ {{{Push}\left( {X_{k + 1},{\sum\limits_{r = i}^{k}{\Delta \; y_{i}}}} \right)},} & \; \\ {{{Push}\left( {X_{i + 1},{\Delta \; y_{i}}} \right)},} & {{{{if}\mspace{14mu} \Delta \; y_{i}} > 0},{{\Delta \; y_{i}} > {y_{i} + 1}}} \\ {{{do}\mspace{14mu} {nothing}},} & {{{if}\mspace{14mu} \Delta \; y_{i}} = 0} \end{matrix} \right.$

That is,

(1) When a difference Δy_(i) between the current size of a data section of the i^(th) stack and the new size of a non-data section is less than 0, a data section of the i^(th) stack having size x_(i) pulls a data section of the i+1 ^(th) stack having size (x_(i+1)) by Δy_(i) (i.e., x_(i+1) is transferred to a lower memory section by Δy_(i)).

(2) When the difference Δy_(i) between the current size of the data section of the corresponding stack and the new size of the non-data section exceeds 0, but is equal to or less than y_(i+1), it is determined that the overlap problem does not occur, and thus the data section having size x_(i) pushes the data section having size x_(i+1) by Δy_(i) (i.e., x_(i+1) is transferred to a higher memory region by Δy_(i)).

(3) However, when the difference Δy_(i) between the current size of the data section of the corresponding stack and the new size of the non-data section exceeds both 0 and y_(i+1,) it is determined that the overlap problem occurs when the data section having size x_(i+1) is pushed by Δy_(i). Therefore, to prevent the overlap problem, a series of push operations with respect to one or more data sections of higher stacks should be performed. When it is assumed that the overlap problem does not occur in size (x_(k),k>=i+2) of a data section of the k^(th) stack, data sections of size x_(i) to size x_(k) allow the transfer without the overlap problem. When it is assumed that the data section having size x_(k) push s the data section having size x_(k+1), a memory space to be pushed is

${\sum\limits_{r = i}^{k}{\Delta \; {y_{i}.{{Push}\left( {x_{k + 1},{\sum\limits_{r = i}^{k}{\Delta \; y_{i}}}} \right)}}}},\ldots \mspace{11mu},{{Push}\left( {x_{i + 1},{\Delta \; y_{i}}} \right)}$

Therefore, is performed.

The present invention may be provided as one or more computer-readable recording media implemented on one or more products. The products may be a floppy disk, a hard disk, a CD ROM, a flash memory card, a PROM, a RAM, a ROM or a magnetic tape. Generally, a computer-readable program may be implemented using an arbitrary programming language. Examples of available languages include C, C++ and JAVA.

As described above, the amount of use of each thread stack is measured in the process of executing a program, and a stack section is dynamically reallocated depending on the amount of use of a stack in the present invention. As a result, a stack space is more efficiently used in the present invention than in a conventional method of statically reallocating a thread stack.

Further, since this method does not require such a complicated process including source code analysis, it can be implemented in a simple manner to accomplish a desired purpose.

In the drawings and specification, typical preferred embodiments of the invention have been disclosed and, although specific terms are employed, they are used in a generic and descriptive sense only and not for purposes of limitation. As for the scope of the invention, it is to be set forth in the following claims. Therefore, it will be understood by those of ordinary skill in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present invention as defined by the following claims. 

1. A method of dynamically allocating a thread stack in a multi-threaded operating system, comprising the steps of: measuring sizes of data and non-data sections of a stack with respect to each thread; determining a new size of the non-data section of each stack based on the size of the data section of the stack measured with respect to each thread; and adjusting the size of the non-data section of each stack to the determined new size.
 2. The method of claim 1, wherein the method is performed at a sensor node.
 3. The method of claim 1, wherein the method is performed whenever a tick interrupt occurs.
 4. The method of claim 1, wherein the new size of the non-data section of each stack is determined to be equal to or greater than a predetermined threshold value.
 5. The method of claim 1, wherein the new size of the non-data section is determined to be about 10% to 20% of the size of the data section.
 6. The method of claim 1, wherein the step of adjusting the size of the non-data section of each stack is sequentially performed from a lower stack to a higher stack.
 7. The method of claim 6, wherein when there is a difference between the current size of a non-data section and the new size of a non-data section of a lower stack, the step of adjusting the size of the non-data section of each stack comprises the step of transferring a data section of a higher stack adjacent to the lower stack to a higher memory region or a lower memory region by the difference.
 8. The method of claim 7, wherein when the difference between the current size of the non-data section and the new size of the non-data section of the lower stack is less than 0, the data section of the adjacent higher stack is transferred to a lower memory region by the difference.
 9. The method of claim 7, wherein when the difference between the current size of the non-data section and the new size of the non-data section of the lower stack exceeds 0, the data section of the adjacent higher stack is transferred to a higher memory region by the difference.
 10. The method of claim 9, wherein the step of adjusting the size of the non-data section of each stack further comprises the step of determining whether or not an overlap problem occurs between stacks adjacent to each other before transferring the data section of the adjacent higher stack to a higher memory region.
 11. The method of claim 10, wherein when the difference between the current size of the non-data section and the new size of the non-data section of the lower stack exceeds the size of the non-data section of the higher stack adjacent to the lower stack, it is determined that the overlap problem occurs.
 12. The method of claim 10, further comprising the step of transferring one or more data sections of higher stacks to an higher memory region when it is determined that the overlap problem occurs.
 13. A computer-readable recording medium, in which a computer program for performing a method of claim 1 is recorded.
 14. The medium of claim 13, wherein the computer program is included in an interrupt service routine of a sensor node operating system. 